Bisimilar Finite Abstractions of Interconnected Systems
نویسندگان
چکیده
This paper addresses the design of approximately bisimilar finite abstractions of systems that are composed of the interconnection of smaller subsystems. First, it is shown that the ordinary notion of approximate bisimulation does not preserve the interconnection structure of the concrete model. Next, a new definition of approximate bisimulation that is compatible with interconnection is proposed. Based on this definition of approximate bisimulation, the design of interconnection-compatible finite abstractions of linear subsystems is discussed.
منابع مشابه
Approximately Bisimilar Finite Abstractions of Stable Linear Systems
The use of bisimilar finite abstractions of continuous and hybrid systems, greatly simplifies complex computational tasks such as verification or control synthesis. Unfortunately, because of the strong requirements of bisimulation relations, such abstractions exist only for quite restrictive classes of systems. Recently, the notion of approximate bisimulation relations has been introduced, allo...
متن کاملSymbolic Models for Retarded Jump-Diffusion Systems
In this paper, we provide for the first time an automated, correct-by-construction, controller synthesis scheme for a class of infinite dimensional stochastic hybrid systems, namely, hybrid stochastic retarded systems. First, we construct finite dimensional abstractions approximately bisimilar to original infinite dimensional stochastic systems having some stability property, namely, incrementa...
متن کاملFinite Abstractions of Discrete-time Linear Systems and Its Application to Optimal Control
Optimal control and reachability analysis of continuous-state systems often require computational algorithms with high complexity. The use of finite abstractions of continuous-state systems reduces such problems to path-planning problems on directed graphs with a finite number of nodes, which can be computed efficiently. In this research, we propose a method to design an approximately bisimilar...
متن کاملFinite Abstractions for the Verification of Epistemic Properties in Open Multi-Agent Systems
We develop a methodology to model and verify open multi-agent systems (OMAS), where agents may join in or leave at run time. Further, we specify properties of interest on OMAS in a variant of firstorder temporal-epistemic logic, whose characterising features include epistemic modalities indexed to individual terms, interpreted on agents appearing at a given state. This formalism notably allows ...
متن کاملCompositional Synthesis of Finite State Abstractions
Controller synthesis techniques for continuous systems with respect to temporal logic specifications typically use an intermediate finite-state symbolic abstraction of the system model. Constructing this abstraction for the entire system is computationally expensive, and does not exploit natural decompositions of many systems into interacting components. We describe a methodology for compositio...
متن کامل